A matheuristic-based approach for the multi-depot home health care assignment, routing and scheduling problem

Home health care structures provide for the elderly, people with disabilities as well patients chronic conditions. Since there has been an increase in demand, organizations providing home are eager to optimize their activities. In addition, patient numbers led expand geographical reach. As a result, tend be located different offices limit travel time and, consequently, caregivers employed by these various must assigned one of so they start and end workday at associated office. Unlike existing literature where upstream assignment is performed become parameter model, solved during resolution problem order obtain best possible combinations. Thus, we suggest mixed-integer programming model multi-depot assignment, routing, scheduling without prior offices. propose original matheuristic-based approach strategies assign visits solve problem. The experiments conducted on set 56 heterogeneous instances sizes. Results compared solutions obtained commercial solver, lower bound Lagrangian relaxation. results highlight efficiency since it provides low deviation ratio faster computational time.